Fast Discrete Fourier Transform Computations Using the Reduced Adder Graph Technique
نویسندگان
چکیده
منابع مشابه
Fast Discrete Fourier Transform Computations Using the Reduced Adder Graph Technique
It has recently been shown that the n-dimensional reduced adder graph (RAG-n) technique is beneficial for many DSP applications such as for FIR and IIR filters, where multipliers can be grouped in multiplier blocks. This paper highlights the importance of DFT and FFT as DSP objects and also explores how the RAG-n technique can be applied to these algorithms. This RAG-n DFT will be shown to be o...
متن کاملVery fast discrete Fourier transform, using number theoretic transform
It is shown that number theoretic transforms (NTT) can be used to compute discrete Fourier transform (DFT) very efficiently. By noting some simple properties of number theory and the DFT, the total number of real multiplications for a length-P DFT is reduced to (P — 1). This requires less than one real multiplication per point. For a proper choice of transform length and NTT, the number of shif...
متن کاملDigital image Watermarking using Two Dimensional Discrete Wavelet Transform, Discrete Cosine Transform and Fast Fourier Transform
Abstract—In digital watermarking, a watermark is embedded into a cover text in such a way that the resulting watermarked signal is robust to certain distortion caused by either standard data processing in a friendly environment or malicious attacks in an unfriendly environment. This paper presents a digital image watermarking based on two dimensional discrete cosines transform (DCT2), two dimen...
متن کاملFast and Efficient Sparse 2D Discrete Fourier Transform using Sparse-Graph Codes
We present a novel algorithm, named the 2D-FFAST 1, to compute a sparse 2D-Discrete Fourier Transform (2D-DFT) featuring both low sample complexity and low computational complexity. The proposed algorithm is based on mixed concepts from signal processing (sub-sampling and aliasing), coding theory (sparse-graph codes) and number theory (Chinese-remainder-theorem) and generalizes the 1D-FFAST 2 a...
متن کاملFast Fourier Transform for Discrete Asian Options
This paper presents an efficient methodology for the discrete Asian options consistent with different types of underlying densities, especially non-normal returns as suggested by the empirical literature (Mandelbrot (1963) and Fama (1965)). The interest of this method is its flexibility compared to the more standard ones. Based on Fast Fourier Transform, the method is an enhanced version of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2007
ISSN: 1687-6180
DOI: 10.1155/2007/67360